Some Combinatorial Theorems for Continuous Parameter Processes.

Matching Theorems for Combinatorial

Some Inference Theorems in Stochastic Processes

Fixed-parameter algorithms for some combinatorial problems in bioinformatics

NP-hard problems occur often in bioinformatics. The typical huge sizes of biological problem instances often prohibit solving NP-hard problems in bioinformatics optimally with classical approaches. Fixed-parameterized algorithmics has been developed in 1990s as a new approach to solve NP-hard problem optimally in a guaranteed running time. The essential idea of fixed-parameter algorithms is to ...

Limit Theorems for Continuous State Branching Processes with Immigration

when nx and n2 are measures on the Borel sets of (0, oo) with the property that r u r u -n^du) + n2(du) <oo; a ^ 0, y ̂ 0, c ^ 0,d ^ 0. J0+ 1 + w J0 + 1 + u Furthermore any set of parameters (a, /?, y, c, d, nl5n2) define a unique ^MS 1970 swfy'ert classifications. Primary 60J80, 60F05; Secondary 60K30.

Limit Theorems for Some Branching Measure-valued Processes

We consider a particle system in continuous time, discrete population, with spatial motion and nonlocal branching. The offspring’s weights and their number may depend on the mother’s weight. Our setting captures, for instance, the processes indexed by a Galton-Watson tree. Using a size-biased auxiliary process for the empirical measure, we determine this asymptotic behaviour. We also obtain a l...